Optimization for Due-Window Assignment Scheduling with Position-Dependent Weights
نویسندگان
چکیده
منابع مشابه
Scheduling problems with a common due window assignment: A survey
In this article a survey of studies on scheduling problems with a common due window assignment and earliness/tardiness penalty functions is presented. A due window is a generalization of the classical due date and describes a time interval in which a job should be finished. If a job is completed before or after the due window, it incurs an earliness or a tardiness penalty, respectively. In this...
متن کاملDue-Window Assignment Scheduling with Variable Job Processing Times
We consider a common due-window assignment scheduling problem jobs with variable job processing times on a single machine, where the processing time of a job is a function of its position in a sequence (i.e., learning effect) or its starting time (i.e., deteriorating effect). The problem is to determine the optimal due-windows, and the processing sequence simultaneously to minimize a cost funct...
متن کاملScheduling a deteriorating maintenance activity and due-window assignment
Several papers published during the last decade dealt with scheduling a maintenance activity and considered a new setting, where the maintenance duration is assumed to be deteriorating, i.e., it requires more time or effort if it is delayed. We study a deteriorating maintenance in the context of due-window assignment, where a time interval is determined such that jobs completed within this inte...
متن کاملGroup scheduling and job-dependent due window assignment based on a common flow allowance
Article history: Received 8 March 2013 Received in revised form 9 September 2013 Accepted 23 November 2013 Available online 1 December 2013
متن کاملSingle Machine Scheduling and Due Date Assignment with Past-Sequence-Dependent Setup Time and Position-Dependent Processing Time
This paper considers single machine scheduling and due date assignment with setup time. The setup time is proportional to the length of the already processed jobs; that is, the setup time is past-sequence-dependent (p-s-d). It is assumed that a job's processing time depends on its position in a sequence. The objective functions include total earliness, the weighted number of tardy jobs, and the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Dynamics in Nature and Society
سال: 2020
ISSN: 1026-0226,1607-887X
DOI: 10.1155/2020/9746538